On languages not recognizable by One-way Measure Many Quantum Finite automaton
نویسنده
چکیده
Measure Many Quantum Finite Automaton is not the strongest known model of quantum automaton but, it is still an open question what is the class of languages recognized by it when only bounded error probability is allowed. In this paper a natural class of ”word set” regular languages are studied. A proof that in general case the class can not be recognized by One-way model of Measure Many Quantum Finite automata is given.
منابع مشابه
On Quantum Pushdown Automata
Quantum finite automata, as well as quantum pushdown automata were first introduced by C. Moore, J. P. Crutchfield [MC 97]. In this paper we introduce the notion of quantum pushdown automata in a non-equivalent way, including unitarity criteria, by using the definition of quantum finite automata of [KW 97]. It is established that the unitarity criteria of quantum pushdown automata are not equiv...
متن کاملMulti-letter Reversible and Quantum Finite Automata
The regular language (a+ b)∗a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of t...
متن کاملOn equivalence and emptiness problems of multi-letter (measure many) quantum finite automata
On equivalence and emptiness problems of multi-letter (measure many) quantum finite automata Abstract In this paper, we study some decision problems both for multi-letter quantum finite au-tomata and measure many multi-letter quantum finite automata. We first show that given a k1-letter quantum finite automaton A1 and a k2-letter quantum finite automaton A2 over the same input alphabet Σ, they ...
متن کاملCharacterizations of 1-Way Quantum Finite Automata
The 2-way quantum finite automaton introduced by Kondacs and Watrous[KW97] can accept non-regular languages with bounded error in polynomial time. If we restrict the head of the automaton to moving classically and to moving only in one direction, the acceptance power of this 1-way quantum finite automaton is reduced to a proper subset of the regular languages. In this paper we study two differe...
متن کاملOn a class of languages recognizable by probabilistic reversible decide-and-halt automata
We analyze the properties of probabilistic reversible decide-and-halt automata (DHPRA) and show that there is a strong relationship between DH-PRA and 1-way quantum automata. We show that a general class of regular languages is not recognizable by DHPRA by proving that two ‘‘forbidden’’ constructions in minimal deterministic automata correspond to languages not recognizable by DH-PRA. The shown...
متن کامل